TOOLympics II: competitions on formal methods
نویسندگان
چکیده
Abstract This is the second issue in new “Competitions and Challenges” (CoCha) theme of International Journal on Software Tools for Technology Transfer. The was established to support competitions challenges with an appropriate publication venue. first presented competition software testing Test-Comp 2019, which part TOOLympics 2019 event. In this TOOLympics, we present selected reports. event took place as 25-years celebration conference TACAS. goal provide overview area formal methods.
منابع مشابه
Applying Heuristic Methods to Schedule Sports Competitions on Multiple Venues
Scheduling sports competitions is a difficult task because it is often very difficult to construct schedules that are considered fair by all competitors. In addition, the schedules should also satisfy a considerably large number of additional requirements and constraints. Most of the sports scheduling problems that have been tackled in the literature refer to competitions in which a venue is as...
متن کاملOn confidentiality and formal methods
The contemporary challenge of engineering verifiably secure software has motivated various techniques for measuring and regulating the flow of confidential data from systems to their users. Unfortunately, these techniques suffer from a lack of integration with modern formal methods for software development, which inhibits their application in practice. This thesis proposes a novel approach for ...
متن کاملALGEBRAIC INDEPENENCE OF CERTAIN FORMAL POWER SERIES (II)
We shall extend the results of [5] and prove that if f = Z o a x ? Z [[X]] is algebraic over Q (x), where a = 1, ƒ 1 and if ? , ? ,..., ? are p-adic integers, then 1 ? , ? ,..., ? are linkarly independent over Q if and only if (1+x) ,(1+x) ,…,(1+x) are algebraically independent over Q (x) if and only if f , f ,.., f are algebraically independent over Q (x)
متن کاملIFM2005 Doctoral Symposium on Integrated Formal Methods
Current mechanizations of programming logics are often in the form of verification condition generators. These frontends to a prover translate a program and assertions into conditions that when proven state that the program fulfils its assertions. Traditional verification condition generators are monolithic encapsulations of a programming language’s semantics. This makes it hard to build such v...
متن کامل1st Irish Workshop on Formal Methods
A formal specification is presented in the Z language for a simplified version of the Single Transferable Vote form of election. This is a correctness-critical application which is one of a class of related and interesting applications, i.e. electoral models. This specification is based on the form of election defined by the Students’ Representative Council of the University of Cape Town , and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2021
ISSN: ['1433-2779', '1433-2787']
DOI: https://doi.org/10.1007/s10009-021-00631-1